RLWE and PLWE over cyclotomic fields are not equivalent
نویسندگان
چکیده
Abstract We prove that the Ring Learning With Errors (RLWE) and Polynomial (PLWE) problems over cyclotomic field $${\mathbb {Q}}(\zeta _n)$$ Q ( ζ n ) are not equivalent. Precisely, we show reducing one problem to other increases noise by a factor is more than polynomial in n . do so providing lower bound, holding for infinitely many positive integers , condition number of Vandermonde matrix th polynomial.
منابع مشابه
Weak Instances of PLWE
In this paper we present a new attack on the polynomial version of the Ring-LWE assumption, for certain carefully chosen number fields. This variant of RLWE, introduced in [BV11] and called the PLWE assumption, is known to be as hard as the RLWE assumption for 2-power cyclotomic number fields, and for cyclotomic number fields in general with a small cost in terms of error growth. For general nu...
متن کاملOn cyclotomic schemes over finite near-fields
We introduce a concept of cyclotomic association scheme over a finite near-field K. It is proved that any isomorphism of two such nontrivial schemes is induced by a suitable element of the group AGL(V ), where V is the linear space associated with K. A sufficient condition on a cyclotomic scheme C that guarantee the inclusion Aut(C)≤ A L(1,F), where F is a finite field with |K| elements, is given.
متن کاملVulnerable Galois RLWE Families and Improved Attacks
Lattice-based cryptography was introduced in the mid 1990s in two different forms, independently by Ajtai-Dwork [AD97] and Hoffstein-Pipher-Silverman [HPSS08]. Thanks to the work of Stehlé-Steinfeld [SS11], we now understand the NTRU cryptosystem introduced by Hoffstein-Pipher-Silverman to be a variant of a cryptosystem which has security reductions to the Ring Learning With Errors (RLWE) probl...
متن کاملComposed products and factors of cyclotomic polynomials over finite fields
Let q = ps be a power of a prime number p and let Fq be a finite field with q elements. This paper aims to demonstrate the utility and relation of composed products to other areas such as the factorization of cyclotomic polynomials, construction of irreducible polynomials, and linear recurrence sequences over Fq . In particular we obtain the explicit factorization of the cyclotomic polynomial Φ...
متن کاملExplicit Factorizations of Cyclotomic and Dickson Polynomials over Finite Fields
We give, over a finite field Fq, explicit factorizations into a product of irreducible polynomials, of the cyclotomic polynomials of order 3 · 2, the Dickson polynomials of the first kind of order 3 · 2 and the Dickson polynomials of the second kind of order 3 · 2 − 1.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applicable Algebra in Engineering, Communication and Computing
سال: 2022
ISSN: ['1432-0622', '0938-1279']
DOI: https://doi.org/10.1007/s00200-022-00552-9